Back Evolución diferencial Spanish Algorithme à évolution différentielle French 差分進化 Japanese 차분 진화 Korean Дифференциальная эволюция Russian Диференціальна еволюція Ukrainian 差分进化算法 Chinese
In evolutionary computation, differential evolution (DE) is a method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Such methods are commonly known as metaheuristics as they make few or no assumptions about the optimized problem and can search very large spaces of candidate solutions. However, metaheuristics such as DE do not guarantee an optimal solution is ever found.
DE is used for multidimensional real-valued functions but does not use the gradient of the problem being optimized, which means DE does not require the optimization problem to be differentiable, as is required by classic optimization methods such as gradient descent and quasi-newton methods. DE can therefore also be used on optimization problems that are not even continuous, are noisy, change over time, etc.[1]
DE optimizes a problem by maintaining a population of candidate solutions and creating new candidate solutions by combining existing ones according to its simple formulae, and then keeping whichever candidate solution has the best score or fitness on the optimization problem at hand. In this way, the optimization problem is treated as a black box that merely provides a measure of quality given a candidate solution and the gradient is therefore not needed.
Storn and Price introduced Differential Evolution in 1995.[2][3][4] Books have been published on theoretical and practical aspects of using DE in parallel computing, multiobjective optimization, constrained optimization, and the books also contain surveys of application areas.[5][6][7][8] Surveys on the multi-faceted research aspects of DE can be found in journal articles .[9][10]
- ^ Cite error: The named reference
elediadereviewwas invoked but never defined (see the help page). - ^ Storn, Rainer; Price, Kenneth (1995). "Differential evolution—a simple and efficient scheme for global optimization over continuous spaces" (PDF). International Computer Science Institute. TR (95). Berkeley: International Computer Science Institute: TR-95-012. Retrieved 3 April 2024.
- ^ Cite error: The named reference
storn97differentialwas invoked but never defined (see the help page). - ^ Cite error: The named reference
storn96usagewas invoked but never defined (see the help page). - ^ Cite error: The named reference
price05differentialwas invoked but never defined (see the help page). - ^ Cite error: The named reference
feoktistov06differentialwas invoked but never defined (see the help page). - ^ G. C. Onwubolu and B V Babu, "New Optimization Techniques in Engineering". Retrieved 17 September 2016.
- ^ Cite error: The named reference
chakraborty08advanceswas invoked but never defined (see the help page). - ^ S. Das and P. N. Suganthan, "Differential Evolution: A Survey of the State-of-the-art", IEEE Trans. on Evolutionary Computation, Vol. 15, No. 1, pp. 4-31, Feb. 2011, DOI: 10.1109/TEVC.2010.2059031.
- ^ S. Das, S. S. Mullick, P. N. Suganthan, "Recent Advances in Differential Evolution - An Updated Survey," Swarm and Evolutionary Computation, doi:10.1016/j.swevo.2016.01.004, 2016.
© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search